Convex Sets and Hexagons
نویسنده
چکیده
Euclid presented his fundamental results about 300 B.C., but Euclidean Geometry is still alive today. We studied the new properties of convex sets and its inscribed hexagons in a two dimensional Euclidean space. As an application, these results solved a question in Geometry of Banach Spaces. From my teaching experience at Community College of Philadelphia, I think the material is reasonable and suitable to be added to the Linear Algebra course and/or Functional Analysis course. It may encourage others to know that the tools we give our students remain useful in modern research.
منابع مشابه
Empty Convex Hexagons in Planar Point Sets
Erdős asked whether every sufficiently large set of points in general position in the plane contains six points that form a convex hexagon without any points from the set in its interior. Such a configuration is called an empty convex hexagon. In this paper, we answer the question in the affirmative. We show that every set that contains the vertex set of a convex 9-gon also contains an empty co...
متن کاملFunctionally closed sets and functionally convex sets in real Banach spaces
Let $X$ be a real normed space, then $C(subseteq X)$ is functionally convex (briefly, $F$-convex), if $T(C)subseteq Bbb R $ is convex for all bounded linear transformations $Tin B(X,R)$; and $K(subseteq X)$ is functionally closed (briefly, $F$-closed), if $T(K)subseteq Bbb R $ is closed for all bounded linear transformations $Tin B(X,R)$. We improve the Krein-Milman theorem ...
متن کاملOn the Erdős Problem of Empty Convex Hexagons
Paul Erdős’s Empty Hexagon Problem asks if there exists a number H(6) such that for all sets of n ≥ H points in general position on the plane six of the points form the vertices of an empty convex hexagon. This problem is open.
متن کاملPlanar Point Sets with a Small Number of Empty Convex Polygons
A subset A of a finite set P of points in the plane is called an empty polygon, if each point of A is a vertex of the convex hull of A and the convex hull of A contains no other points of P . We construct a set of n points in general position in the plane with only ≈ 1.62n empty triangles, ≈ 1.94n empty quadrilaterals, ≈ 1.02n empty pentagons, and ≈ 0.2n empty hexagons.
متن کاملOn empty pentagons and hexagons in planar point sets
We give improved lower bounds on the minimum number of k-holes (empty convex k-gons) in a set of n points in general position in the plane, for k = 5, 6.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002